#include <iostream>
#include <vector>
using namespace std;

int n;

int main() {
    cin >> n;
    vector<int> nums(n);
    int sum = 0;
    for (int i = 0; i < n; i++)
    {
        cin >> nums[i];
        sum += nums[i];
    }
    if (sum % 2)
    {
        cout << "false" << endl;
        return 0;
    }
    sum /= 2;
    vector<bool> f(sum + 1);
    f[0] = true;
    for (int i = 0; i < n; i++)
        for (int j = sum; j >= nums[i]; j--)
            f[j] = f[j] || f[j - nums[i]];

    if (f[sum])  cout << "true" << endl;
    else cout << "false" << endl;
    return 0;
}

bool hostschedule(vector<vector<int> >& s) {
    sort(s.begin(), s.end());

    int end = 0;
    bool flag = true;
    for (int i = 0; i < s.size(); i++)
    {
        int l = s[i][0], r = s[i][1];
        if (l < end)
        {
            flag = false;
            break;
        }
        end = r;
    }
    return flag;
}